Fast computation of the Nth root
نویسندگان
چکیده
منابع مشابه
HSI based colour image equalization using iterative nth root and nth power
In this paper an equalization technique for colour images is introduced. The method is based on n th root and n th power equalization approach but with optimization of the mean of the image in different colour channels such as RGB and HSI. The performance of the proposed method has been measured by the means of peak signal to noise ratio. The proposed algorithm has been compared with convention...
متن کاملCMOS Current-Mode Companding Multiplier/Divider and Its Nth-Root
A CMOS current-mode companding multiplier/divider composed of three compact logarithm circuits and one compact exponential circuit is proposed. Approaches for constructing the logarithm circuits and the exponential circuit are based on second-order Taylor series approximations. By gathering the three logarithm results and passing through the exponential circuit, we can obtain the result of zp(x...
متن کاملFast Computation of Gauss Sums and Resolution of the Root of Unity Ambiguity
We present an algorithm for computing Gauss sums over Fq for large prime powers q. This allows us to find the exact values of Gauss sums in many previously intractable cases. The efficient computation of such Gauss sums up to multiplication with a root of unity is achieved by using Stickelberger’s factorization of Gauss sums, an application of the Fincke-Pohst algorithm, and fast arithmetic for...
متن کاملThe Complexity of Boolean Matrix Root Computation
We show that finding roots of Boolean matrices is an NPhard problem. This answers a twenty year old question from semigroup theory. Interpreting Boolean matrices as directed graphs, we further reveal a connection between Boolean matrix roots and graph isomorphism, which leads to a proof that for a certain subclass of Boolean matrices related to subdivision digraphs, root finding is of the same ...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1989
ISSN: 0898-1221
DOI: 10.1016/0898-1221(89)90024-2